Problem set - PDFSEARCH.IO - Document Search Engine

Problem set
Results: 1590

#	Item
841	ICS 260 – Fall 2001 – Final Exam Name: Answer Key Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-12-12 17:36:39 NP-complete problems Travelling salesman problem Independent set NP-complete Set cover problem NP Directed acyclic graph Kernelization Vertex cover Theoretical computer science Computational complexity theory Mathematics
842	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Stabbing Polygonal Chains with Rays is Hard to Approximate Steven Chaplick∗ Elad Cohen† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:57 NP-complete problems Vertex cover Reduction Ordinal number Parameterized complexity Cardinality APX Set cover problem Polygonal chain Theoretical computer science Computational complexity theory Mathematics
843	GES175, Science of Soils Fall 2004 Lecture Problem Set 1 DuePresently there are an estimated 60 million people in Bangladesh exposed to drinking water having arsenic concentrations beyond the limits established Add to Reading List Source URL: soils.stanford.edu Language: English - Date: 2004-10-12 18:31:42 Soil physics Soil mechanics Water Hydrogeology Aquifers Arsenic Soil Porosity Water content Chemistry Hydrology Matter
844	Optimal Convex Partitions of Point Sets with Few Inner Points Andreas Spillner∗ Abstract We present a fixed-parameter algorithm for the Minimum Convex Partition and the Minimum Weight Convex Partition problem. On a set Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:54 Mathematical optimization Computational geometry Dynamic programming Equations Systems engineering Algorithm Travelling salesman problem Convex hull Kirkpatrick–Seidel algorithm Operations research Mathematics Applied mathematics
845	Disjoint, Partition and Intersection Constraints for Set and Multiset Variables Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2010-11-22 06:22:29 Software engineering Local consistency Multiset Boolean satisfiability problem Cardinality Decomposition method Linear programming relaxation Constraint programming Theoretical computer science Mathematics
846	Parameterized Approximation via Fidelity Preserving Transformations Michael R. Fellows1 , Ariel Kulik2 , Frances Rosamond1 , and Hadas Shachnai3? 1 School of Engineering and IT, Charles Darwin Univ., Darwin, NT Australi Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-03-01 11:15:08 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Vertex cover Time complexity Steiner tree problem Theoretical computer science Computational complexity theory Applied mathematics
847	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:22 NP-complete problems Operations research Approximation algorithm Travelling salesman problem APX Steiner tree problem Algorithm Set cover problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
848	On k-Enclosing Objects in a Coloured Point Set Luis Barba∗ Stephane Durocher†‡ Debajyoti Mondal† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Discrete mathematics Computational geometry Diagrams Voronoi diagram Proximity problems Time complexity Largest empty rectangle Smallest circle problem Mathematics Theoretical computer science Discrete geometry
849	Astro 321: Problem Set 5 Due Feb 11 This problem set requires the code from Problem Set 4. 1 Add to Reading List Source URL: background.uchicago.edu Language: English - Date: 2011-08-15 18:34:55 Partial differential equations Physical cosmology Harmonic analysis
850	Journal of Computational and Applied Mathematics–227 www.elsevier.com/locate/cam Numerical solution of the Minkowski problem a Add to Reading List Source URL: www.rni.helsinki.fi Language: English - Date: 2008-04-16 06:00:33 Convex analysis Convex function Convex hull Vector space Convex set Continuous function Spherical harmonics Locally convex topological vector space Shapley–Folkman lemma Mathematical analysis Mathematics Algebra

UPDATE